By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Volume 9, Issue 1, pp. 1-166

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A Characterization of Nonnegative Box-Greedy Matrices

Ulrich Faigle, Alan J. Hoffman, and Walter Kern

pp. 1-6

Efficient Gossiping by Packets in Networks with Random Faults

Krzysztof Diks and Andrzej Pelc

pp. 7-18

Short Random Walks on Graphs

Greg Barnes and Uriel Feige

pp. 19-28

The Biased Coin Problem

Ravi B. Boppana and Babu O. Narayanan

pp. 29-36

Spanners of Hypercube-Derived Networks

Marie-Claude Heydemann, Joseph G. Peters, and Dominique Sotteau

pp. 37-54

Lower Bounds on Representing Boolean Functions as Polynomials in $Z_m $

Shi-Chun Tsai

pp. 55-62

On Convex Subsets in Tournaments

David J. Haglin and Marty J. Wolf

pp. 63-70

Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections

Satoru Iwata and Kazuo Murota

pp. 71-86

Data Security Equals Graph Connectivity

Ming-Yang Kao

pp. 87-100

On Linear Recognition of Tree-Width at Most Four

Daniel P. Sanders

pp. 101-117

Chip-Firing Games on Mutating Graphs

Kimmo Eriksson

pp. 118-128

Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus

L. Aleksandrov and H. Djidjev

pp. 129-150

Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups

Brian Alspach, Yi-Ping Liu, and Cun-Quan Zhang

pp. 151-154

Tight Bounds for Dynamic Storage Allocation

Michael G. Luby, Joseph (Seffi) Naor, and Ariel Orda

pp. 155-166